Two Papers on the Selection Problem TIME BOUNDS FOR SELECTION
نویسندگان
چکیده
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm -PICK. Specifically, no more than 5.4305 n comparisons are ever required. This bound is improved for extreme values of i , and a new lower bound on the requisite number of comparisons is also proved. This work was supported by the National Science Foundation under grants GJ-992 and GJ-33170X.
منابع مشابه
The multi-objective decision making methods based on MULTIMOORA and MOOSRA for the laptop selection problem
A decision making process requires the values of conflicting objectives for alternatives and the selection of the best alternative according to the needs of decision makers. Multi-objective optimization methods may provide solution for this selection. In this paper it is aimed to present the laptop selection problem based on MOORA plus full multiplicative form (MULTIMOORA) and multi-objective o...
متن کاملA Supplier Selection Model for Social Responsible Supply Chain
Due to the importance of supplier selection issue in supply chain management (SCM) and ,also, the increasing tendency of organizations to their social responsibilities, In this paper, we survey the supplier selection issue as a multi objective problem while considering the factor of corporate social responsibility (CSR) as a mathematical parameter. The purpose of this paper is to design a mode...
متن کاملSupplier selection using compromise ranking and outranking methods
In today’s highly competitive manufacturing environment, an effective supplier selection process is very important for the success of any business organization. Selection of the best supplier is always a difficult task for the purchasing manager. Suppliers have varied strengths and weaknesses which require careful assessment by the purchasing manager before selecting and ranking them. Any suppl...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملمساله پوشش هاب تک تخصیصی بر روی شبکه ستارهای؛ مدلبندی، خطیسازی و یافتن کران مناسب برای آن
The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...
متن کاملAn Additive Weighted Fuzzy Programming for Supplier Selection Problem in a Supply Chain
Supplier selection is one of the most important activities of purchasing departments. This importance is increased even more by new strategies in a supply chain, because of the key role suppliers perform in terms of quality, costs and services which affect the outcome in the buyer’s company. Supplier selection is a multiple criteria decision making problem in which the objectives are not equa...
متن کامل